Philosophy Dictionary of ArgumentsHome
| |||
|
| |||
| Lambda Calculus, philosophy: The lambda calculus provides a way to avoid problems related to paradoxes, since, unlike the quantification of predicate logic, it does not make any existence assumptions. Where the quantification (Ex)(Fx) is translated colloquially as "There is an x with the property F" (in short "Something is F"), the translation of the corresponding form in the Lambda calculus is "An x, so that...". See also 2nd order logic._____________Annotation: The above characterizations of concepts are neither definitions nor exhausting presentations of problems related to them. Instead, they are intended to give a short introduction to the contributions below. – Lexicon of Arguments. | |||
| Author | Concept | Summary/Quotes | Sources |
|---|---|---|---|
|
John Bigelow on Lambda Calculus - Dictionary of Arguments
I 98 Rules/composition/composition rules/syntax/Bigelow/Pargetter: one can also go the other way and want to simplify the rules. That is what the λ-categorical language/Lambda calculus/Lambda notation/Lambda abstraction/Bigelow/Pargetter does: (see also Cresswell I and II, as well as Montague). >Lambda-Abstraction/Cresswell, >R. Montague. For example: Negation: surprisingly, one can assign a referent to it and keep it thus out of the rules: I 99 Vs: we then have another referential layer in the theory. Example Negation: we can assign a set theoretical symbol that represents the value "true" or "false". ((s) Truth value/Frege/(s): assigns a referent to the negation, a "thing": "the false". >Truth values, >Existence, >Objects, >Reference, >Sets, >Set theory. Bigelow/Pargetter: then we have a judgement function that assigns the semantic value (or referent) V(a) to a symbol a. >Valuation. 1: be "true". 0: be "false". Def semantic value: (the negation V(a)) is then the function ω~, so that ω ~ (1) = 0 ω ~ (0) = 1 is appropriate for compound expressions (internal/external negation, conjunction, etc.) >Semantic value, >Outer negation, >Negation, >Conjunction. I 100 Lambda categorical language/λ/Lambda/Rules/Bigelow/Pargetter: such languages have extremely few composition rules. We have more referring symbols for this. >Rules, >Symbols. Realism: would describe this as ontologically honest. Semantics/Bigelow/Pargetter: but the realist does not have to commit himself to one semantics instead of another. >Realism. The semantics does not decide upon ontology. >Semantics, >Ontology._____________Explanation of symbols: Roman numerals indicate the source, arabic numerals indicate the page number. The corresponding books are indicated on the right hand side. ((s)…): Comment by the sender of the contribution. Translations: Dictionary of Arguments The note [Concept/Author], [Author1]Vs[Author2] or [Author]Vs[term] resp. "problem:"/"solution:", "old:"/"new:" and "thesis:" is an addition from the Dictionary of Arguments. If a German edition is specified, the page numbers refer to this edition. |
Big I J. Bigelow, R. Pargetter Science and Necessity Cambridge 1990 |
||
> Counter arguments against Bigelow
> Counter arguments in relation to Lambda Calculus
Ed. Martin Schulz, access date 2024-04-27